Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(neq, 0), 0) -> false
app2(app2(neq, 0), app2(s, y)) -> true
app2(app2(neq, app2(s, x)), 0) -> true
app2(app2(neq, app2(s, x)), app2(s, y)) -> app2(app2(neq, x), y)
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, y), ys)) -> app2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
app2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> app2(app2(cons, y), app2(app2(filter, f), ys))
app2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> app2(app2(filter, f), ys)
nonzero -> app2(filter, app2(neq, 0))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(neq, 0), 0) -> false
app2(app2(neq, 0), app2(s, y)) -> true
app2(app2(neq, app2(s, x)), 0) -> true
app2(app2(neq, app2(s, x)), app2(s, y)) -> app2(app2(neq, x), y)
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, y), ys)) -> app2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
app2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> app2(app2(cons, y), app2(app2(filter, f), ys))
app2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> app2(app2(filter, f), ys)
nonzero -> app2(filter, app2(neq, 0))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(app2(neq, app2(s, x)), app2(s, y)) -> APP2(neq, x)
APP2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> APP2(app2(cons, y), app2(app2(filter, f), ys))
NONZERO -> APP2(neq, 0)
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(filtersub, app2(f, y))
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(app2(filtersub, app2(f, y)), f)
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(f, y)
APP2(app2(neq, app2(s, x)), app2(s, y)) -> APP2(app2(neq, x), y)
APP2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> APP2(filter, f)
APP2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> APP2(app2(filter, f), ys)
APP2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> APP2(filter, f)
APP2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> APP2(app2(filter, f), ys)
NONZERO -> APP2(filter, app2(neq, 0))

The TRS R consists of the following rules:

app2(app2(neq, 0), 0) -> false
app2(app2(neq, 0), app2(s, y)) -> true
app2(app2(neq, app2(s, x)), 0) -> true
app2(app2(neq, app2(s, x)), app2(s, y)) -> app2(app2(neq, x), y)
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, y), ys)) -> app2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
app2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> app2(app2(cons, y), app2(app2(filter, f), ys))
app2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> app2(app2(filter, f), ys)
nonzero -> app2(filter, app2(neq, 0))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(neq, app2(s, x)), app2(s, y)) -> APP2(neq, x)
APP2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> APP2(app2(cons, y), app2(app2(filter, f), ys))
NONZERO -> APP2(neq, 0)
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(filtersub, app2(f, y))
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(app2(filtersub, app2(f, y)), f)
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(f, y)
APP2(app2(neq, app2(s, x)), app2(s, y)) -> APP2(app2(neq, x), y)
APP2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> APP2(filter, f)
APP2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> APP2(app2(filter, f), ys)
APP2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> APP2(filter, f)
APP2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> APP2(app2(filter, f), ys)
NONZERO -> APP2(filter, app2(neq, 0))

The TRS R consists of the following rules:

app2(app2(neq, 0), 0) -> false
app2(app2(neq, 0), app2(s, y)) -> true
app2(app2(neq, app2(s, x)), 0) -> true
app2(app2(neq, app2(s, x)), app2(s, y)) -> app2(app2(neq, x), y)
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, y), ys)) -> app2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
app2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> app2(app2(cons, y), app2(app2(filter, f), ys))
app2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> app2(app2(filter, f), ys)
nonzero -> app2(filter, app2(neq, 0))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 8 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(neq, app2(s, x)), app2(s, y)) -> APP2(app2(neq, x), y)

The TRS R consists of the following rules:

app2(app2(neq, 0), 0) -> false
app2(app2(neq, 0), app2(s, y)) -> true
app2(app2(neq, app2(s, x)), 0) -> true
app2(app2(neq, app2(s, x)), app2(s, y)) -> app2(app2(neq, x), y)
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, y), ys)) -> app2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
app2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> app2(app2(cons, y), app2(app2(filter, f), ys))
app2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> app2(app2(filter, f), ys)
nonzero -> app2(filter, app2(neq, 0))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(neq, app2(s, x)), app2(s, y)) -> APP2(app2(neq, x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( neq ) = 3


POL( s ) = max{0, -2}


POL( APP2(x1, x2) ) = x1 + 1


POL( app2(x1, x2) ) = 3x1 + 2x2 + 3



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(neq, 0), 0) -> false
app2(app2(neq, 0), app2(s, y)) -> true
app2(app2(neq, app2(s, x)), 0) -> true
app2(app2(neq, app2(s, x)), app2(s, y)) -> app2(app2(neq, x), y)
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, y), ys)) -> app2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
app2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> app2(app2(cons, y), app2(app2(filter, f), ys))
app2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> app2(app2(filter, f), ys)
nonzero -> app2(filter, app2(neq, 0))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> APP2(app2(filter, f), ys)
APP2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> APP2(app2(filter, f), ys)
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(f, y)
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))

The TRS R consists of the following rules:

app2(app2(neq, 0), 0) -> false
app2(app2(neq, 0), app2(s, y)) -> true
app2(app2(neq, app2(s, x)), 0) -> true
app2(app2(neq, app2(s, x)), app2(s, y)) -> app2(app2(neq, x), y)
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, y), ys)) -> app2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
app2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> app2(app2(cons, y), app2(app2(filter, f), ys))
app2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> app2(app2(filter, f), ys)
nonzero -> app2(filter, app2(neq, 0))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> APP2(app2(filter, f), ys)
APP2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> APP2(app2(filter, f), ys)
APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(f, y)
The remaining pairs can at least be oriented weakly.

APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( true ) = 0


POL( filter ) = max{0, -3}


POL( neq ) = 2


POL( filtersub ) = 2


POL( false ) = 1


POL( app2(x1, x2) ) = max{0, 2x1 + 2x2 - 3}


POL( 0 ) = 1


POL( APP2(x1, x2) ) = max{0, 2x2 - 3}


POL( s ) = 2


POL( nil ) = 3


POL( cons ) = 3



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(filter, f), app2(app2(cons, y), ys)) -> APP2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))

The TRS R consists of the following rules:

app2(app2(neq, 0), 0) -> false
app2(app2(neq, 0), app2(s, y)) -> true
app2(app2(neq, app2(s, x)), 0) -> true
app2(app2(neq, app2(s, x)), app2(s, y)) -> app2(app2(neq, x), y)
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, y), ys)) -> app2(app2(app2(filtersub, app2(f, y)), f), app2(app2(cons, y), ys))
app2(app2(app2(filtersub, true), f), app2(app2(cons, y), ys)) -> app2(app2(cons, y), app2(app2(filter, f), ys))
app2(app2(app2(filtersub, false), f), app2(app2(cons, y), ys)) -> app2(app2(filter, f), ys)
nonzero -> app2(filter, app2(neq, 0))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.